Adaptive Phototransistor Sensor for Line Finding
نویسندگان
چکیده
منابع مشابه
An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملAn Adaptive Congestion Alleviating Protocol for Healthcare Applications in Wireless Body Sensor Networks: Learning Automata Approach
Wireless Body Sensor Networks (WBSNs) involve a convergence of biosensors, wireless communication and networks technologies. WBSN enables real-time healthcare services to users. Wireless sensors can be used to monitor patients’ physical conditions and transfer real time vital signs to the emergency center or individual doctors. Wireless networks are subject to more packet loss and congestion. T...
متن کاملUltrasonic Range Finding Sensor
During the research within the MAURO (Mobile Autonomous Robot) project (1995 – 1998) the research team from the 'Robot Control Systems' Laboratory has designed and realized an ultrasonic range finding sensor intended to be used in mobile robot navigation. The sensor has been successively improved and the design was adopted also by other research teams within the Automation Department being used...
متن کاملHeterojunction phototransistor for highly sensitive infrared detection
In this work, we have proposed a model for the ultimate physical limit on the sensitivity of the heterojunction bipolar phototransistors (HPTs). Based on our modeling we have extracted the design criteria for the HPT for high sensitivity application. HPT with the submicron emitter and base area has the potential to be used for the low number photon resolving in near-infrared (NIR) wavelength. H...
متن کاملAdaptive Designs for Stochastic Root-Finding
The Robbins-Monro procedure (1951) for stochastic root-finding is a nonparametric approach. Wu (1985, 1986) has shown that the convergence of the sequential procedure can be greatly improved if we know the distribution of the response. Wu’s approach assumes a parametric model and therefore its convergence rate slows down when the assumed model is very different from the true model. This article...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.07.168